Quantum curves for the enumeration of ribbon graphs and hypermaps

نویسندگان

  • Norman Do
  • David Manescu
چکیده

The topological recursion of Eynard and Orantin governs a variety of problems in enumerative geometry and mathematical physics. The recursion uses the data of a spectral curve to define an infinite family of multidifferentials. It has been conjectured that, under certain conditions, the spectral curve possesses a non-commutative quantisation whose associated differential operator annihilates the partition function for the spectral curve. In this paper, we determine the quantum curves and partition functions for an infinite sequence of enumerative problems involving generalisations of ribbon graphs known as hypermaps. These results give rise to an explicit conjecture relating hypermap enumeration to the topological recursion and we provide evidence to support this conjecture.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partial Duality of Hypermaps

We introduce a collection of new operations on hypermaps, partial duality, which include the classical Euler-Poincaré dualities as particular cases. These operations generalize the partial duality for maps, or ribbon graphs, recently discovered in a connection with knot theory. Partial duality is different from previous studied operations of S. Wilson, G. Jones, L. James, and A. Vince. Combinat...

متن کامل

Enumeration of unrooted hypermaps of a given genus

In this paper we derive an enumeration formula for the number of hypermaps of a given genus g and given number of darts n in terms of the numbers of rooted hypermaps of genus γ ≤ g with m darts, where m|n. Explicit expressions for the number of rooted hypermaps of genus g with n darts were derived by Walsh (1975) for g = 0, and by Arques (1987) for g = 1. We apply our general counting formula t...

متن کامل

A CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION

‎The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$‎. ‎In this case‎, ‎$B$ is called a textit{metric basis} for $G$‎. ‎The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$‎. ‎Givi...

متن کامل

Enumeration of N -rooted maps using quantum field theory

A one-to-one correspondence is proved between the N -rooted ribbon graphs, or maps, with e edges and the (e−N + 1)-loop Feynman diagrams of a certain quantum field theory. This result is used to obtain explicit expressions and relations for the generating functions of N -rooted maps and for the numbers of N -rooted maps with a given number of edges using the path integral approach applied to th...

متن کامل

Edge-contraction on Dual Ribbon Graphs, 2d Tqft, and the Mirror of Orbifold Hurwitz Numbers

We present a new set of axioms for a 2D TQFT formulated on the category of the dual of ribbon graphs with edge-contraction operations as morphisms. Every Frobenius algebra A determines a contravariant functor from this category to the category of elements of the tensor category of Frobenius algebras over A∗. The functor evaluated at connected graphs is the TQFT corresponding to A. The edge-cont...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013